Distributed Recursive Least-Squares: Stability and Performance Analysis
نویسندگان
چکیده
منابع مشابه
Stability Analysis of the QR-Recursive Least Squares Algorithm
This paper presents a detailed stability analysis of the QR-RLS algorithm implemented with finite-precision arithmetic. The recursive equations describing the quantization error propagation are deduced and analysed in detail. The stability conditions are then derived. In addition, for the case the tap coefficients are calculed through the backsubstitution algorithm, new analytical expressions f...
متن کاملPerformance Analysis of $l_0$ Norm Constrained Recursive Least Squares Algorithm
Performance analysis of l0 norm constrained Recursive least Squares (RLS) algorithm is attempted in this paper. Though the performance pretty attractive compared to its various alternatives, no thorough study of theoretical analysis has been performed. Like the popular l0 Least Mean Squares (LMS) algorithm, in l0 RLS, a l0 norm penalty is added to provide zero tap attractions on the instantaneo...
متن کاملKernel Recursive Least Squares
We present a non-linear kernel-based version of the Recursive Least Squares (RLS) algorithm. Our Kernel-RLS algorithm performs linear regression in the feature space induced by a Mercer kernel, and can therefore be used to recursively construct the minimum meansquared-error regressor. Sparsity (and therefore regularization) of the solution is achieved by an explicit greedy sparsification proces...
متن کاملRecursive Least Squares Estimation
We start with estimation of a constant based on several noisy measurements. Suppose we have a resistor but do not know its resistance. So we measure it several times using a cheap (and noisy) multimeter. How do we come up with a good estimate of the resistance based on these noisy measurements? More formally, suppose x = (x1, x2, . . . , xn) T is a constant but unknown vector, and y = (y1, y2, ...
متن کاملNumerical stability issues of the conventional recursive least squares algorithm
The continuous use of adaptive algorithms is strongly dependent on their behavior in finite-precision environments. We study the nonlinear round-off error accumulation system of the conventional RLS algorithm and we derive bounds for the relative precision of the computations and the accumulated round-off error, which guarantee the numerical stability of the finite-precision implementation of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2012
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2012.2194290